Alignment and Distribution Is Not (Always) NP-Hard
نویسندگان
چکیده
منابع مشابه
Spi Alignment and Distribution Is Not (always) Np-hard Alignment and Distribution Is Not (always) Np-hard Alignment and Distribution Is Not (always) Np-hard
In this paper, an eecient algorithm to simultaneously implement array alignment and data/computation distribution is introduced and evaluated. We re-visit previous work of Li and Chen 13, 14], and we show that their alignment step should not be conducted without preserving the potential parallelism. In other words, the optimal alignment may well sequentialize computations, whatever the distribu...
متن کاملAlignment and Distribution is NOT (Always) NP-Hard
In this paper, an efficient algorithm to simultaneously implement array alignment and data computation distribution is introduced and evaluated. We revisit previous work of J. Li and M. Chen (in ``Frontiers 90: The Third Symposium on the Frontiers of Massively Parallel Computation,'' pp. 424 433, College Park MD, Oct. 1990; and J. Parallel Distrib. Comput. 13 (1991), 213 221), and we show that ...
متن کاملDiploid Alignment is NP-hard
Human genomes consist of pairs of homologous chromosomes, one of which is inherited from the mother and the other from the father. Species, such as human, with pairs of homologous chromosomes are called diploid. Sequence analysis literature is, however, almost solely built under the model of a single haplotype sequence representing a species. This fundamental choice is apparently due to the hug...
متن کاملTrainyard is NP-hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – a...
متن کاملLearning Sparse Causal Models is not NP-hard
This paper shows that causal model discovery is not an NP-hard problem, in the sense that for sparse graphs bounded by node degree k the sound and complete causal model can be obtained in worst case order N independence tests, even when latent variables and selection bias may be present. We present a modification of the well-known FCI algorithm that implements the method for an independence ora...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2001
ISSN: 0743-7315
DOI: 10.1006/jpdc.2000.1683